基于云重心评判法的炮兵指挥训练水平评估*

炮兵指挥训练水平指标体系中,既有精确数值型表示的,又有语言值来描述的,给评估指标的数据处理带来了一定的困难。云重心评判法能较好地处理该类既有定性指标,又有定量指标的综合评价问题。构建了炮兵师(旅)指挥训练水平评估体系,详细介绍了运用云重心评判法来实现炮兵指挥训练水平评估的具体步骤。结合指挥决策指标体系实例,验证了该方法的有效。该方法具有一定的推广意义。     

Subspace dynamic‐simplex linear interpolation search for mixed‐integer black‐box optimization problems

Design and management of complex systems with both integer and continuous decision variables can be guided using mixed‐integer optimization models and analysis. We propose a new mixed‐integer black‐box optimization (MIBO) method, subspace dynamic‐simplex linear interpolation search (SD‐SLIS), for decision making problems in which system performance can only be evaluated with a computer black‐box model. Through a sequence of gradient‐type local searches in subspaces of solution space, SD‐SLIS is particularly efficient for such MIBO problems with scaling issues. We discuss the convergence conditions and properties of SD‐SLIS algorithms for a class of MIBO problems. Under mild conditions, SD‐SLIS is proved to converge to a stationary solution asymptotically. We apply SD‐SLIS to six example problems including two MIBO problems associated with petroleum field development projects. The algorithm performance of SD‐SLIS is compared with that of a state‐of‐the‐art direct‐search method, NOMAD, and that of a full space simplex interpolation search, Full‐SLIS. The numerical results suggest that SD‐SLIS solves the example problems efficiently and outperforms the compared methods for most of the example cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 305–322, 2017     

多雷达观测信号融合检测算法

针对海上小目标检测问题提出了一种基于多雷达观测信号层融合的检测算法。该算法对各个雷达的观测值按采样时刻进行排序,然后根据对应时刻的脉冲信号进行高阶互累积量计算然后在相关域上积累进行似然比检测。仿真分析表明该算法与基于贝叶斯准则的分布式检测算法相比,具有较低的复杂度和低信噪比条件下较高的目标检测概率。     

基于三方动态博弈模型的网络生存防御策略优化配置

针对网络攻防环境中防御方以提高系统生存能力为目的所进行的最优生存防御策略的选取问题,提出了一种基于完全信息动态博弈理论的生存防御策略优化配置算法。将恶意攻击方、故障意外事件及防御方作为博弈的参与人,提出了一种混合战略模式下的三方动态博弈模型,对博弈的主要信息要素进行了说明,以混合战略纳什均衡理论为基础,将原纳什均衡条件式的表达式转化为可计算数值结果的表达式,并据此增加了近似的概念,最后,将提出的模型和近似纳什均衡求解算法应用到一个网络实例中,结果证明了模型和算法的可行性和有效性。     

运用粒子群优化算法的平流层飞艇总体设计

平流层飞艇总重最小化能一定程度上反映总费用最低的设计目标,满足有效载荷功率需求是飞艇总体设计的出发点和落脚点。在飞艇参数建模中引入太阳电池曲面铺装模型以及昼夜能源闭环模型;以整艇重量最小为设计目标,以昼夜能源供需平衡、浮重平衡、推阻平衡三大平衡问题为约束条件,运用粒子群优化算法对飞艇的外形尺寸参数进行优化设计;分析了有效载荷功率需求和功率密度对于飞艇总体设计结果的敏感性。分析结果表明:飞艇总重随有效载荷功率线性增加;飞艇总重随有效载荷功率密度增加而迅速减小,但变化率逐渐变小,飞艇总重趋于稳定。能源系统仿真的结果表明了飞艇总体设计方法的有效性和设计结果的临界特性。     

北斗系统三频载波相位整周模糊度快速解算

北斗导航定位系统播发三个频率观测值,有助于载波相位整周模糊度的快速、准确固定。传统的几何无关模型三频载波相位模糊度固定算法通常采用遍历整数搜索的方法确定载波相位-伪距组合系数,组合后的噪声因子较大,模糊度固定成功率不高。在分析了北斗系统伪距测量误差特性的基础上,给出了加权组合噪声因子的定义及其约束下的最优组合系数的求解方法。采用Hatch滤波提高电离层延时误差实时估计精度,成功固定三组线性无关组合系数对应整周模糊度,进而确定基础整周模糊度。利用北斗系统短基线、长基线实测数据对算法性能进行了验证,实验表明:提出的算法可优化超宽巷、宽巷组合噪声因子20%以上,模糊度固定成功率提高10%~18%左右,30s历元平滑后的基础模糊度固定成功率可达90%以上。     

基于改进平方根UKF双向滤波的单站无源定位算法

针对单站无源定位可观测性弱、观测噪声大而导致的定位精度低、稳定性差和收敛速度慢等问题,在结合平方根无迹卡尔曼滤波(Square-Root Unscented Kalman Filter,SRUKF)以及后向平滑思想的基础上,提出了一种改进SRUKF的双向滤波算法。该算法采用Q-R分解的形式,使用误差协方差的平方根代替协方差参与递推运算,提高了算法的稳定性与运算效率。同时,该算法对状态向量进行扩维,将过程噪声与观测噪声通过非线性系统传播,降低了噪声对滤波精度的影响,并利用当前时刻滤波结果通过Rauch-Tung-Striebel(RTS)后向平滑得到再次前向滤波更高精度的起始值,提高了算法的定位精度与收敛速度。仿真结果表明,新算法在保证实时性的基础上改善了单站无源定位的性能。     

单晶硅反射镜激光能量吸收系数与衬底表面质量的关联

高能激光系统中,单晶硅基底反射镜的能量吸收系数是影响系统性能的关键指标。衬底加工质量对镀膜后元件激光能量吸收系数影响显著。通过测试不同衬底粗糙度、划痕密度的单晶硅反射元件,分析衬底表面典型加工特征(粗糙度、划痕)对激光能量吸收系数的影响规律,认为粗糙度与吸收系数正相关,粗糙度均方根从0.668nm降低至0.345nm会使吸收系数降低28.0%。少量划痕对吸收系数的直接影响并不明显,吸收系数均值变化在3.1%以内。但表面划痕会诱发激光损伤,划痕密度较大时会引起后续能量吸收持续增大,辐照400s后,吸收系数较辐照100s时增大18.3%。     

机载相控阵雷达搜索模式辐射能量控制方法

机载相控阵雷达过高的辐射能量威胁了战斗机的生存能力。为了减少相控阵雷达搜索模式辐射能量,提出了基于辐射能量控制的搜索模型。将总能量消耗函数和检测概率相对误差作为目标函数,以平均功率、波束宽度、积累脉冲数以及脉冲重复间隔作为优化变量,选取非支配遗传排序算法对此模型进行优化。仿真结果表明,在同样检测概率情况下,提出的搜索方法可以有效控制雷达辐射能量,具有更好的射频隐身性能。     

Single machine just‐in‐time scheduling problems with two competing agents

In scheduling problems with two competing agents, each one of the agents has his own set of jobs to be processed and his own objective function, and both share a common processor. In the single‐machine problem studied in this article, the goal is to find a joint schedule that minimizes the total deviation of the job completion times of the first agent from a common due‐date, subject to an upper bound on the maximum deviation of job completion times of the second agent. The problem is shown to be NP‐hard even for a nonrestrictive due‐date, and a pseudopolynomial dynamic program is introduced and tested numerically. For the case of a restrictive due‐date (a sufficiently small due‐date that may restrict the number of early jobs), a faster pseudopolynomial dynamic program is presented. We also study the multiagent case, which is proved to be strongly NP‐hard. A simple heuristic for this case is introduced, which is tested numerically against a lower bound, obtained by extending the dynamic programming algorithm. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 1–16, 2014